Solving Crossword Puzzles via the Google API
نویسندگان
چکیده
The GoogleTM API enables software agents to query and use search results from the large collections of data available via the ever-popular Google search engine. Web searches using Google are exposed to over 4 billion pages, many of which are cached within Google. While the Google API may be used to produce customized user interfaces to Google, the API also provides direct programmatic access to the subset of the Web covered by Google. In this paper, we present a fresh approach to solving crossword puzzles by making use of the Google API. Our system, the Google CruciVerbalist (GCV), reads XML-encoded crossword puzzles, derives answers to clues via the Google API, and uses a refined depth-first search algorithm to populate the crossword grid. GCV has successfully solved smaller puzzles, especially ones containing pop-culture and fill-in-the-blank types of clues. Based on this ongoing work, limitations of current search technologies are identified. To overcome these limitations, we look ahead to semantic queries via the emerging Semantic Web, including techniques using RDF that augment the Google search engine with semantic information, enabling semantically rich queries beyond the current capabilities of Google.
منابع مشابه
Learning to Rank Answer Candidates for Automatic Resolution of Crossword Puzzles
In this paper, we study the impact of relational and syntactic representations for an interesting and challenging task: the automatic resolution of crossword puzzles. Automatic solvers are typically based on two answer retrieval modules: (i) a web search engine, e.g., Google, Bing, etc. and (ii) a database (DB) system for accessing previously resolved crossword puzzles. We show that learning to...
متن کاملCrossword expertise as recognitional decision making: an artificial intelligence approach
THE SKILLS REQUIRED TO SOLVE CROSSWORD PUZZLES INVOLVE TWO IMPORTANT ASPECTS OF LEXICAL MEMORY: semantic information in the form of clues that indicate the meaning of the answer, and orthographic patterns that constrain the possibilities but may also provide hints to possible answers. Mueller and Thanasuan (2013) proposed a model accounting for the simple memory access processes involved in sol...
متن کاملA probabilistic approach to solving crossword puzzles
We attacked the problem of solving crossword puzzles by computer: given a set of clues and a crossword grid, try to maximize the number of words correctly filled in. After an analysis of a large collection of puzzles, we decided to use an open architecture in which independent programs specialize in solving specific types of clues, drawing on ideas from information retrieval, database search, a...
متن کاملSearch Lessons Learned from Crossword Puzzles Search Lessons Learned from Crossword Puzzles
The construction of a program that generates crossword puzzles is discussed. The aim of this research is to draw conclusions that apply to conjunctive search generally, and the experimental results obtained in the crossword-puzzle domain lead us to the following: (1) Lookahead is extremely important when solving conjunctive queries, (2) Compile-time control of search is far less eeective than i...
متن کاملSolving Crossword Puzzles as Probabilistic Constraint Satisfaction
Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we describe a formal model of constraint satisf...
متن کامل